A LAN Voting Protocol
نویسندگان
چکیده
This paper presents a set of network protocols which provide for a voting service. The service is currently being implemented in the client-server architecture. The cryptographic technique combined with the basic voting protocol from Salomaa 19] is the method based on the multiple key ciphers introduced by Boyd 2]. Special protocols for registration of voters and issuing voting slips are developed. This ensures that the anonymity of a voting strategy is cryptographically secure and, on the other hand, that only legitimate voters may obtain a valid voting slip.
منابع مشابه
Double voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملVoting with Bystanders
Voting protocols ensure the consistency of replicated data objects by disallowing all read and write requests that cannot collect the appropriate quorum of replicas. Voting protocols require a minimum number of three copies to be of any practical use and often disallow a relatively high number of read and write requests. We present here a voting protocol overcoming this limitation and providing...
متن کاملCollaborative approach to mitigating ARP poisoning-based Man-in-the-Middle attacks
In this paper, we propose a new mechanism for counteracting ARP (Address Resolution Protocol) poisoning-based Man-in-the-Middle (MITM) attacks in a subnet, where wired and wireless nodes can coexist. The key idea is that even a new node can be protected from an ARP cache poisoning attack if the mapping between an IP and the corresponding MAC addresses is resolved through fair voting among neigh...
متن کاملDynamic Management of Highly Replicated Data
We present an efficient replication control protocol for managing replicated data objects that have more than five replicas. Like the grid protocol, our dynamic group protocol requires only O(√dn ) messages per access to enforce mutual consistency among n replicas. Unlike other protocols aimed at providing fast access, our protocol adapts itself to changes in site availability and network conne...
متن کاملMitigating ARP Poisoning-based Man-in-the-Middle Attacks in Wired or Wireless LAN
In this article, an enhanced version of address resolution protocol (ARP) is proposed to prevent ARP poisoningbased man-in-the-middle (MITM) attacks in wired or wireless LAN environments. The proposed mechanism is based on the idea that when a node knows the correct MAC address for a given IP address, if it does not delete the mapping while the machine is alive, then MITM attack is not possible...
متن کامل